A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems
نویسندگان
چکیده
We consider a generalized form of the conventional decentralized control architecture for discrete-event systems where the control actions of a set of supervisors can bè`fused'' using both union and intersection of enabled events. Namely, the supervisors agree a priori on choosing``fusion by union'' for certain controllable events and``fusion by intersection'' for certain other controllable events. We show that under this architecture, a larger class of languages can be achieved than before since a relaxed version of the notion of co-observability appears in the necessary and suf®cient conditions for the existence of supervisors. The computational complexity of verifying these new conditions is studied. A method of partitioning the controllable events between``fusion by union'' and``fusion by intersection'' is presented. The algebraic properties of co-observability in the context of this architecture are presented. We show that appropriate combinations of fusion rules with corresponding decoupled local decision rules guarantee the safety of the closed-loop behavior with respect to a given speci®cation that is not co-observable. We characterize an``optimal'' combination of fusion rules among those combinations guaranteeing the safety of the closed-loop behavior. In addition, a simple supervisor synthesis technique generating the in®mal pre®x-closed controllable and co-observable superlanguage is presented.
منابع مشابه
Reliable supervisory control for general architecture of decentralized discrete event systems
In this paper, we investigate the reliable decentralized supervisory control of discrete event systems (DESs) under the general architecture, where the decision for controllable events is a combination of the conjunctive and disjunctive fusion rules. By reliable control, we mean that the performance of closedloop systems will not be degraded even in the face of possible failures of some local s...
متن کاملPartial Observation in Distributed Supervisory Control of Discrete-Event Systems
Distributed supervisory control is a method to synthesize local controllers in discrete-eventsystems with a systematic observation of the plant. Some works were reported on extending this methodby which local controllers are constructed so that observation properties are preserved from monolithic todistributed supervisory control, in an up-down approach. In this paper, we find circumstances in ...
متن کاملDecentralized Supervisory Control of Discrete Event Systems: involving the fusion system in the decision-making
In the decentralized control of Discrete Event Systems, a set of supervisors take enabling/disabling decisions which can be fused for deducing actual decisions. The first architecture that has been developed for decentralized control is referred to as the conjunctive architecture. Several more general architectures have subsequently been proposed. We propose a new architecture, whose basic prin...
متن کاملDecentralized Supervisory Control Using Dynamic Default Control
The conventional decentralized supervisory control architectures for discrete event systems assume that default control of controllable events is static. In this paper, we propose a new decentralized supervisory control architecture using dynamic default control of controllable events. We present necessary and sufficient conditions for the existence of a decentralized supervisor in the proposed...
متن کاملSupervisory Control of Interacting Discrete Event Systems
In this paper we present a theory for decentralized supervisory control of a general class of multiprocess discrete event systems referred to as interacting discrete event systems (IDES). An IDES is a discrete event system that consists of a number of components working concurrently and possibly restricted by a well-defined interaction specification. We extend the notion of decentralized superv...
متن کاملDecentralized Supervisory Control of Discrete Event Systems for Bisimulation Equivalence
In decentralized systems, branching behaviors naturally arise due to communication, unmodeled dynamics and system abstraction, which can not be adequately captured by the traditional sequencing-based language equivalence. As a finer behavior equivalence than language equivalence, bisimulation not only allows the full set of branching behaviors but also explicitly specifies the properties in ter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Event Dynamic Systems
دوره 12 شماره
صفحات -
تاریخ انتشار 2002